Wiring Space Estimation in Two Dimensional Arrays 1
نویسندگان
چکیده
We propose a new global routing area estimation approach for high-performance VLSI and MCMs. The objective is to route nets with minimum density of global cells, producing a two-bend routing for each two-terminal net. A solution to this problem can also be used for quick estimation of necessary wiring space (for standard cell array designs) and diiculty of routing (for gate array designs) in the early design planning stage.
منابع مشابه
Wiring Space Estimation in Two-Dimensional Arrays
We propose a new global routing area estimation approach for high-performance VLSI and MCMs. The objective is to route nets with minimum density of global cells, producing a four-bend routing for each two-terminal net. A solution to this problem can also be used for quick estimation of necessary wiring space (for standard cell array designs) and difficulty of routing (for gate array designs) in...
متن کاملProbabilistic Estimation for Routing Space
Interconnect congestion estimation plays an important role in design automation of VLSI designs. This paper presents a novel probabilistic approach to predict the wiring space in two-dimensional arrays. We propose a hierarchical estimation method to derive approximated upper bounds for the wiring space, and we use the net density distribution to predict the routing congestion. Experimental resu...
متن کاملOn Theoretical Upper Bounds for Routing Estimation
Routing space estimation plays a crucial role in design automation of digital systems. We investigate the problem of estimating upper bounds for global routing of two-terminal nets in two-dimensional arrays. We show the soundness of the bounds for both wiring space and total wire-length estimation.
متن کاملWiring space and length estimation in two-dimensional arrays
We propose a new global routing area estimation approach for high-performance very large scale integration and multichip modules (MCM’s). The objective is to route nets with minimum density of global cells, producing a four-bend routing for each two-terminal net. We propose an approximate upper bound on global cell 2 log( (2 )), in an two-dimensional array, where is the estimated lowerbound den...
متن کاملDevelopment a New Technique Based on Least Square Method to Synthesize the Pattern of Equally Space Linear Arrays
Using the sampled data of a desired pattern is a common technique in pattern synthesizing of array factor (AF) of antenna arrays. Based on the obtained data matrix, Least Square Method (LSM) is used to calculate the exciting coefficient of array elements. The most important parameter, which involves the accuracy and complexity of calculation, is the sampling rate of the desired pattern. Classic...
متن کامل